On local connectivity of graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the edge-connectivity of C_4-free graphs

Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...

متن کامل

On the Eccentric Connectivity Index of Unicyclic Graphs

In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.

متن کامل

Detachments Preserving Local Edge-Connectivity of Graphs

Let G = (V + s,E) be a graph and let S = (d1, ..., dp) be a set of positive integers with ∑ dj = d(s). An S-detachment splits s into a set of p independent vertices s1, ..., sp with d(sj) = dj , 1 ≤ j ≤ p. Given a requirement function r(u, v) on pairs of vertices of V , an S-detachment is called r-admissible if the detached graph G satisfies λG′(x, y) ≥ r(x, y) for every pair x, y ∈ V . Here λH...

متن کامل

On local connectivity of K2, p-free graphs

For a vertex v of a graph G, we denote by d(v) the degree of v. The local connectivity κ(u, v) of two vertices u and v in a graph G is the maximum number of internally disjoint u–v paths in G. Clearly, κ(u, v) ≤ min{d(u), d(v)} for all pairs u and v of vertices in G. We call a graph G maximally local connected when κ(u, v) = min{d(u), d(v)} for all pairs u and v of distinct vertices in G. Let p...

متن کامل

Eccentric Connectivity Index of Some Dendrimer Graphs

The eccentricity connectivity index of a molecular graph G is defined as (G) = aV(G) deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to other vertices of G and deg(a) is degree of vertex a. Here, we compute this topological index for some infinite classes of dendrimer graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 2008

ISSN: 0893-9659

DOI: 10.1016/j.aml.2006.12.014